Accelerated iterative method for Z-matrices
نویسندگان
چکیده
منابع مشابه
Improvements of two preconditioned AOR iterative methods for Z-matrices
In this paper, we propose two preconditioned AOR iterative methods to solve systems of linear equations whose coefficient matrices are Z-matrix. These methods can be considered as improvements of two previously presented ones in the literature. Finally some numerical experiments are given to show the effectiveness of the proposed preconditioners.
متن کاملPreconditioned Mixed-Type Splitting Iterative Method For Z-Matrices
In this paper, we present the preconditioned mixed-type splitting iterative method for solving the linear systems, Ax = b, where A is a Z-matrix. And we give some comparison theorems to show that the convergence rate of the preconditioned mixed-type splitting iterative method is faster than that of the mixed-type splitting iterative method. Finally, we give a numerical example to illustrate our...
متن کاملPreconditioned Gauss-seidel Iterative Method for Z-matrices Linear Systems
For Ax = b, it has recently been reported that the convergence of the preconditioned Gauss-Seidel iterative method which uses a matrix of the type P = I + S (α) to perform certain elementary row operations on is faster than the basic Gauss-Seidel method. In this paper, we discuss the adaptive Gauss-Seidel iterative method which uses P = I + S (α) + K̄ (β) as a preconditioner. We present some com...
متن کاملimprovements of two preconditioned aor iterative methods for z-matrices
in this paper, we propose two preconditioned aor iterative methods to solve systems of linear equations whose coefficient matrices are z-matrix. these methods can be considered as improvements of two previously presented ones in the literature. finally some numerical experiments are given to show the effectiveness of the proposed preconditioners.
متن کاملAn accelerated iterative method for computing weighted Moore-Penrose inverse
The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(96)00061-1